# ---
# title: 1668. Maximum Repeating Substring
# id: problem1668
# author: Tian Jun
# date: 2020-10-31
# difficulty: Easy
# categories: String
# link: <https://leetcode.com/problems/maximum-repeating-substring/description/>
# hidden: true
# ---
# 
# For a string `sequence`, a string `word` is **`k`-repeating** if `word`
# concatenated `k` times is a substring of `sequence`. The `word`'s
# **maximum`k`-repeating value** is the highest value `k` where `word` is
# `k`-repeating in `sequence`. If `word` is not a substring of `sequence`,
# `word`'s maximum `k`-repeating value is `0`.
# 
# Given strings `sequence` and `word`, return _the **maximum`k`-repeating
# value** of `word` in `sequence`_.
# 
# 
# 
# **Example 1:**
# 
#     
#     
#     Input: sequence = "ababc", word = "ab"
#     Output: 2
#     Explanation: "abab" is a substring in " _abab_ c".
#     
# 
# **Example 2:**
# 
#     
#     
#     Input: sequence = "ababc", word = "ba"
#     Output: 1
#     Explanation: "ba" is a substring in "a _ba_ bc". "baba" is not a substring in "ababc".
#     
# 
# **Example 3:**
# 
#     
#     
#     Input: sequence = "ababc", word = "ac"
#     Output: 0
#     Explanation: "ac" is not a substring in "ababc". 
#     
# 
# 
# 
# **Constraints:**
# 
#   * `1 <= sequence.length <= 100`
#   * `1 <= word.length <= 100`
#   * `sequence` and `word` contains only lowercase English letters.
# 
# 
## @lc code=start
using LeetCode

## add your code here:
## @lc code=end
